Multi-modal Cognitive Architectures: A Partial Solution to the Frame Problem

نویسنده

  • Unmesh Kurup
چکیده

Since its definition by McCarthy in 1969, the Frame Problem (FP) has been one of the more heavily debated problems in AI. Part of the debate has been on the exact definition of what the FP really is. The computational aspect of the FP can be thought of as reasoning about what changes and what doesn’t change in a dynamic world. The “sleeping dog strategy” is considered to be a viable solution to this aspect of the FP. We intend to show that this strategy has a weakness that can be partially solved using diagrammatic reasoning, under certain conditions. A related and equally important problem, called the Ramification Problem, is to be able to reason about the indirect effects of an action in the world. Our proposal provides a more efficient solution to the Ramification Problem when reasoning about spatial relations. To illustrate our solution, we introduce a problem solving architecture based on Soar that is augmented with a diagrammatic reasoning component. A problem state in this augmented Soar is bi-modal in nature, one part being symbolic and the other diagrammatic. We describe its use in certain problems and show how the use of diagrams can handle the frame and ramification problems with respect to spatial relations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Public Transport Ontology for Passenger Information Retrieval

Passenger information aims at improving the user-friendliness of public transport systems while influencing passenger route choices to satisfy transit user’s travel requirements. The integration of transit information from multiple agencies is a major challenge in implementation of multi-modal passenger information systems. The problem of information sharing is further compounded by the multi-l...

متن کامل

GENERALIZED FLEXIBILITY-BASED MODEL UPDATING APPROACH VIA DEMOCRATIC PARTICLE SWARM OPTIMIZATION ALGORITHM FOR STRUCTURAL DAMAGE PROGNOSIS

This paper presents a new model updating approach for structural damage localization and quantification. Based on the Modal Assurance Criterion (MAC), a new damage-sensitive cost function is introduced by employing the main diagonal and anti-diagonal members of the calculated Generalized Flexibility Matrix (GFM) for the monitored structure and its analytical model. Then, ...

متن کامل

Closed-loop Supply Chain Inventory-location Problem with Spare Parts in a Multi-Modal Repair Condition

In this paper, a closed-loop location-inventory problem for spare parts is presented. The proposed supply chain network includes two echelons, namely (1) distribution centers (DCs) and repairing centers (RCs) and (2) operational bases. Multiple spare parts are distributed among operational bases from distribution centers in the forward supply chain and failed spare parts from operational bases ...

متن کامل

OPTIMAL SENSOR PLACEMENT FOR MODAL IDENTIFICATION OF A STRAP-BRACED COLD FORMED STEEL FRAME BASED ON IMPROVED GENETIC ALGORITHM

This paper is concerned with the determination of optimal sensor locations for structural modal identification in a strap-braced cold formed steel frame based on an improved genetic algorithm (IGA). Six different optimal sensor placement performance indices have been taken as the fitness functions two based on modal assurance criterion (MAC), two based on maximization of the determinant of a Fi...

متن کامل

Capacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search

The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006